#include "sort.hpp"

#include <iostream>
#include <algorithm>
int main()
{
    std::vector<int> data = {2, 1, 5, 6, 3, 90, 40};
    mystl::greater<int> great;
    // mystl::quick_sort<int>(data,0,data.size() - 1,great);
    mystl::Stable_Sort<int>(data,0,data.size()- 1,great);
    for(auto& x : data)
    {
        std::cout<<x<<" ";
    }
    std::cout<<"\n";
    return 0;
}